On Finding Primal- and Dual-Optimal Bases
نویسنده
چکیده
We show that if there exists a strongly polynomial time algorithm that nds a basis which is optimal for both the primal and the dual problems given an optimal solution for one of the problems then there exists a strongly polyno mial algorithm for the general linear programming problem On other hand we give a strongly polynomial time algorithm that nds such a basis given any pair of optimal solutions not necessarily basic for the primal and the dual problems Such an algorithm is needed when one is using an interior point method and is interested in nding a basis which is both primal and dual optimal Subject classi cation Programming Linear Algorithms and Theory
منابع مشابه
Closing the gap in pivot methods for linear programming
We propose pivot methods that solve linear programs by trying to close the duality gap from both ends. The first method maintains a set B of at most three bases, each of a different type, in each iteration: a primal feasible basis Bp, a dual feasible basis Bd and a primal-and-dual infeasible basis Bi. From each B ∈ B, it evaluates the primal and dual feasibility of all primal and dual pivots to...
متن کاملSome new results on semi fully fuzzy linear programming problems
There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...
متن کاملNumbers of Primal and Dual Bases of Network Flow and Unimodular Integer Programs
To integer programming, a ideals have been problems, which Hiroki Nakayama The University of Tokyo (Received October 27, 2003) Hiroshi Imai jases and standard pairs via toric ilgebraic approaches using Grobner k studied in recent years. In this paper, we consider a unimodular case, e.g., network flow enables us to analyze primal and dual problems in an equal setting. By combining existing resul...
متن کاملDualistic computational algebraic analyses of primal and dual minimum cost flow problems on acyclic tournament graphs
To integer programming problems, computational algebraic approaches using Gröbner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time complexity bound compared with existing methods for solving integer programming problems, these give algebraic analysis of their structures. In this paper, we focus...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- INFORMS Journal on Computing
دوره 3 شماره
صفحات -
تاریخ انتشار 1991